package com.myhome.money.base.collection;

/**
 * @author 许路路
 */
public class PriorityQueueDemo {

    private int[] queue;

    public PriorityQueueDemo(int[] queue) {
        this.queue = queue;
    }

    public static void main(String[] args) {
        int[] queue = {23, 3, 44, 7, 99, 65, 8, 87, 0, -1, 2, 3, 5, 764, 34};
        PriorityQueueDemo demo = new PriorityQueueDemo(queue);
        demo.createHead();
    }


    /**
     * 把原始数组变为小顶堆结构
     */
    public void createHead() {

    }

    /**
     * 最小元素出堆并删除
     *
     * @return
     */
    private int pop() {
        return 0;
    }

    /**
     * 入队
     *
     * @param n
     */
    private void push(int n) {

    }


}
